Quantum algorithm for SAT problem andquantum mutual entropy
نویسندگان
چکیده
منابع مشابه
Quantum Algorithm for SAT Problem and Quantum Mutual Entropy
It is von Neumann who opened the window for today’s Information epoch. He defined quantum entropy including Shannon’s information more than 20 years ahead of Shannon, and he introduced a concept what computation means mathematically. In this paper I will report two works that we have recently done, one of which is on quantum algorithum in generalized sense solvimg the SAT problem (one of NP com...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملFundamentals of Quantum Mutual Entropy and Capacity
The study of mutual entropy (information) and capacity in classical system was extensively done after Shannon by several authors like Kolmogorov [12] and Gelfand [7]. In quantum systems, there have been several definitions of the mutual entropy for classical input and quantum output [5, 8, 9, 14]. In 1983, the author defined [21] the fully quantum mechanical mutual entropy by means of the relat...
متن کاملQuantum Entanglements and Entangled Mutual Entropy
The mathematical structure of quantum entanglement is studied and classified from the point of view of quantum compound states. We show that the classical-quantum correspondences such as encodings can be treated as diagonal (d-) entanglements. The mutual entropy of the d-compound and entangled states lead to two different types of entropies for a given quantum state: the von Neumann entropy, wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Reports on Mathematical Physics
سال: 2005
ISSN: 0034-4877
DOI: 10.1016/s0034-4877(05)80007-2